An Exact l 1 Exponential Penalty Function Method for Multiobjective Optimization Problems with Exponential-Type Invexity
نویسندگان
چکیده
منابع مشابه
Convergence of exponential penalty function method for multiobjective fractional programming problems
Exponential penalty function method; Multiobjective fractional programming problem; Convergence Abstract In this paper, we extend the application of exponential penalty function method for solving multiobjective programming problem introduced by Liu and Feng (2010) to solve multiobjective fractional programming problem and analyze the relationship between weak efficient solutions of penalized p...
متن کاملThe Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
The exactness of the penalization for the exact l1 penalty function method used for solving nonsmooth constrained optimization problems with both inequality and equality constraints are presented. Thus, the equivalence between the sets of optimal solutions in the nonsmooth constrained optimization problem and its associated penalized optimization problem with the exact l1 penalty function is es...
متن کاملNonsmooth Continuous-Time Multiobjective Optimization Problems with Invexity
A few Karush-Kuhn-Tucker type of sufficient optimality conditions are given in this paper for nonsmooth continuous-time nonlinear multi-objective optimization problems in the Banach space L∞ [0, T ] of all n-dimensional vector-valued Lebesgue measurable functions which are essentially bounded, using Clarke regularity and generalized convexity. Further, we establish duality theorems for Wolfe an...
متن کاملExponential Penalty Function Control of Loss Networks
We introduce penalty-function-based admission control policies to approximately maximize the expected reward rate in a loss network. These control policies are easy to implement and perform well both in the transient period as well as in steady state. A major advantage of the penalty approach is that it avoids solving the associated dynamic program. However, a disadvantage of this approach is t...
متن کاملResearch Article Continuous-Time Multiobjective Optimization Problems via Invexity
We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity. Using the concept of Karush-Kuhn-Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush-Kuhn-Tucker pseudoinvex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of China
سال: 2014
ISSN: 2194-668X,2194-6698
DOI: 10.1007/s40305-014-0038-y